Binary Structuring Elements Decomposition Based on an Improved Recursive Dilation-Union Model and RSAPSO Method
نویسندگان
چکیده
1 School of Computer Science and Technology, Nanjing Normal University, Nanjing, Jiangsu 210023, China 2 School of Electronic Science and Engineering, Nanjing University, Nanjing, Jiangsu 210046, China 3 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China 4 School of Natural Sciences and Mathematics, Shepherd University, Shepherdstown, WV 25443, USA 5 Translational Imaging Division and MRI Unit, Columbia University and New York State Psychiatric Institute, New York, NY 10032, USA
منابع مشابه
Convex Structuring Element Decomposition for Single Scan Binary Mathematical Morphology
This paper presents a structuring element decomposition method and a corresponding morphological erosion algorithm able to compute the binary erosion of an image using a single regular pass whatever the size of the convex structuring element. Similarly to classical dilation-based methods, the proposed decomposition is iterative and builds a growing set of structuring elements. The novelty consi...
متن کاملGray-Scale Structuring Element Decomposition - Image Processing, IEEE Transactions on
AbstructEfficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. In this paper, we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find a...
متن کاملCamps , Kanungo and Haralick : Grayscale Sturcturing Element Decomposition
| EEcient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick presented a search algorithm to nd optimal decompositions of structuring elements in binary morphology. In this paper we use the concepts of Top of a set and Umbra of a surface to extend this algorithm to nd an optimal dec...
متن کاملGray-scale structuring element decomposition
Efficient implementation of morphological operations requires the decomposition of structuring elements into the dilation of smaller structuring elements. Zhuang and Haralick (1986) presented a search algorithm to find optimal decompositions of structuring elements in binary morphology. We use the concepts of Top of a set and Umbra of a surface to extend this algorithm to find an optimal decomp...
متن کاملRecursive binary dilation and erosion using digital line structuring elements in arbitrary orientations
Performing morphological operations such as dilation and erosion of binary images, using very long line structuring elements is computationally expensive when performed brute-force following definitions. We present two-pass algorithms that run at constant time for obtaining binary dilations and erosions with all possible length line structuring elements, simultaneously. The algorithms run at co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014